翻訳と辞書 Words near each other ・ Hananasif ・ Hanancha ・ Hananchi ・ Hanandō Station ・ Hanane Ouhaddou ・ Hananeel (tower) ・ Hananel Meller ・ Hanang District ・ Hanani ・ Hanani (name) ・ Hanania Baer ・ Hananiah ・ Hananiah (Samaritan) ・ Hananiah b. Hezekiah b. Garon ・ Hananiah Harari ・ Hanani–Tutte theorem ・ Hananokuni Akihiro ・ Hananosato Yukio ・ Hananoumi Ken ・ Hananu Revolt ・ Hananuma Masakichi ・ Hanany–Witten transition ・ Hanaoka ・ Hanaoka mine ・ Hanaoka Seishū ・ Hanaokachō, Tokyo ・ Hanaoui ・ Hanap ・ Hanapepe Dream ・ Hanapepe massacre Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Hanani–Tutte theorem ： ウィキペディア英語版 Hanani–Tutte theorem In topological graph theory, the Hanani–Tutte theorem is a result on the parity of edge crossings in a graph drawing. It states that every drawing in the plane of a non-planar graph contains a pair of independent edges (not both sharing an endpoint) that cross each other an odd number of times. Equivalently, it can be phrased as a planarity criterion: a graph is planar if and only if it has a drawing in which every pair of independent edges crosses evenly (or not at all).〔.〕 ==History== The result is named after Haim Hanani, who proved in 1934 that every drawing of the two minimal non-planar graphs ''K''5 and ''K''3,3 has a pair of edges with an odd number of crossings,〔. See in particular (1), p. 137.〕 and after W. T. Tutte, who stated the full theorem explicitly in 1970.〔.〕 A parallel development of similar ideas in algebraic topology has been credited to Egbert van Kampen, Arnold S. Shapiro, and Wu Wenjun.〔.〕〔.〕〔.〕〔.〕〔. Continued in (6 (1): 23–35, 1986 ).〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Hanani–Tutte theorem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.